Edit languages for information trees

We consider a simple set of edit operations for unordered, edge-labeled trees, called information trees by Dal Zilio et al [DLM04]. We define tree languages using the sheaves automata from [FPS07] which in turn are based on [DLM04] and provide an algorithm for deciding whether a complex edit preserves membership in a tree language. This allows us to view sheaves automata and subsets of tree edits as edit languages in the sense of [HPW12]. They can then be used to instantiate the framework of edit lenses between such languages and model concrete examples such as synchronisation between different file systems or address directories.